Asymptotic independence in large random permutations with fixed descent set
نویسندگان
چکیده
منابع مشابه
Random Fixed Point Theorems for Asymptotic 1-set Contraction Operators
Random fixed point theorems for condensing 1-set contraction selfmaps are known. But no random fixed point theorem for more general asymptotic 1-set contraction selfmaps is yet available. The purpose of this paper is to prove random fixed point theorems for such maps. 1. Introduction. Random fixed point theorems are stochastic versions of (classical or deterministic) fixed point theorems and ar...
متن کاملAnalyzing Random Permutations for Cyclic Coordinate Descent
We consider coordinate descent methods on convex quadratic problems, in which exact line searches are performed at each iteration. (This algorithm is identical to Gauss-Seidel on the equivalent symmetric positive definite linear system.) We describe a class of convex quadratic problems for which the random-permutations version of cyclic coordinate descent (RPCD) outperforms the standard cyclic ...
متن کاملCounting Permutations with Given Cycle Structure and Descent Set
The purpose of this paper is to count permutations in S , with a given cycle structure and a given descent set. Our main result (Theorem 2.1) asserts that the number of these permutations can be expressed as a scalar product of two symmetric functions, one associated with the cycle structure and the other with the descent set. Both of these symmetric functions can be interpreted as characterist...
متن کاملA nonparametric independence test using random permutations
We propose a new nonparametric test for the supposition of independence between two continuous random variables X and Y. Given a sample of (X,Y ), the test is based on the size of the longest increasing subsequence of the permutation which maps the ranks of the X observations to the ranks of the Y observations. We identify the independence assumption between the two continuous variables with th...
متن کاملGenerating Functions for Permutations which Contain a Given Descent Set
A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation σ, des(σ), arise in this way. For any given finite set S of positive integers, we develop a method to produce similar generating functions for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2015
ISSN: 1083-6489
DOI: 10.1214/ejp.v20-4196